Quantum Random Walks do not need a Coin Toss

Classical randomized algorithms use a coin toss instruction to explore different evolutionary branches of a problem. Quantum algorithms, on the other hand, can explore multiple evolutionary branches by mere superposition of states. Discrete quantum random walks, studied in the literature, have nonetheless used both superposition and a quantum coin toss instruction. This is not necessary, and a discrete quantum random walk without a quantum coin toss instruction is defined and analyzed here. Our construction eliminates quantum entanglement from the algorithm, and the results match those obtained with a quantum coin toss instruction.Comment: 6 pages, 4 figures, RevTeX (v2) Expanded to include relation to quantum walk with a coin. Connection with Dirac equation pointed out. Version to be published in Phys. Rev.

A Study on the Effect of Enterprise Resource Planning (ERP) on People of an Organization

The ultimate objective of any organizational initiative to install ERP system is to reveal some advantage, whether it is associated with cost savings, improved efficiencies, or better decision-making. These systems can in the long run save millions of dollars, improve quality of information, and increase workers’ productivity by reducing the amount of time to do a job. ERP systems can virtually eliminate the redundancies that occur from outdated and disparate systems that may be present in each department of an organization. This paper highlights the effect of ERP systems on the people of an organization. The results indicated that employees, customers and suppliers were benefitted due to installation of ERP systems while external agencies were not affected due to ERP systems

Mixing Times in Quantum Walks on Two-Dimensional Grids

Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution operator for this particular graph. The limiting distribution and mixing time of a quantum walk with a coin operator modified as in the abstract search algorithm are obtained numerically. On the basis of these results, the relation between the mixing time of the modified walk and the running time of the corresponding abstract search algorithm is discussed.Comment: 11 page

Application of artificial neural networks to weighted interval Kalman filtering

The interval Kalman filter is a variant of the traditional Kalman filter for systems with bounded parametric uncertainty. For such systems, modelled in terms of intervals, the interval Kalman filter provides estimates of the system state also in the form of intervals, guaranteed to contain the Kalman filter estimates of all point-valued systems contained in the interval model. However, for practical purposes, a single, point-valued estimate of the system state is often required. This point value can be seen as a weighted average of the interval bounds provided by the interval Kalman filter. This article proposes a methodology based on the application of artificial neural networks by which an adequate weight can be computed at each time step, whereby the weighted average of the interval bounds approximates the optimal estimate or estimate which would be obtained using a Kalman filter if no parametric uncertainty was present in the system model, even when this is not the case. The practical applicability and robustness of the method are demonstrated through its application to the navigation of an uninhabited surface vehicle. © IMechE 2014

On the application of a hybrid ellipsoidal-rectangular interval arithmetic algorithm to interval Kalman filtering for state estimation of uncertain systems

Modelling uncertainty is a key limitation to the applicability of the classical Kalman filter for state estimation of dynamic systems. For such systems with bounded modelling uncertainty, the interval Kalman filter (IKF) is a direct extension of the former to interval systems. However, its usage is not yet widespread owing to the over-conservatism of interval arithmetic bounds. In this paper, the IKF equations are adapted to use an ellipsoidal arithmetic that, in some cases, provides tighter bounds than direct, rectangular interval arithmetic. In order for the IKF to be useful, it must be able to provide reasonable enclosures under all circumstances. To this end, a hybrid ellipsoidal-rectangular enclosure algorithm is proposed, and its robustness is evidenced by its application to two characteristically different systems for which it provides stable estimate bounds, whereas the rectangular and ellipsoidal approaches fail to accomplish this in either one or the other case

Non-linear control algorithms for an unmanned surface vehicle

Although intrinsically marine craft are known to exhibit non-linear dynamic characteristics, modern marine autopilot system designs continue to be developed based on both linear and non-linear control approaches. This article evaluates two novel non-linear autopilot designs based on non-linear local control network and non-linear model predictive control approaches to establish their effectiveness in terms of control activity expenditure, power consumption and mission duration length under similar operating conditions. From practical point of view, autopilot with less energy consumption would in reality provide the battery-powered vehicle with longer mission duration. The autopilot systems are used to control the non-linear yaw dynamics of an unmanned surface vehicle named Springer. The yaw dynamics of the vehicle being modelled using a multi-layer perceptron-type neural network. Simulation results showed that the autopilot based on local control network method performed better for Springer. Furthermore, on the whole, the local control network methodology can be regarded as a plausible paradigm for marine control system design. © 2014 IMechE

Thresholded Covering Algorithms for Robust and Max-Min Optimization

The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should you anticipatorily buy today, so that the worst-case cost (summed over both days) is minimized? Feige et al. and Khandekar et al. considered the k-robust model where the possible outcomes tomorrow are given by all demand-subsets of size k, and gave algorithms for the set cover problem, and the Steiner tree and facility location problems in this model, respectively. In this paper, we give the following simple and intuitive template for k-robust problems: "having built some anticipatory solution, if there exists a single demand whose augmentation cost is larger than some threshold, augment the anticipatory solution to cover this demand as well, and repeat". In this paper we show that this template gives us improved approximation algorithms for k-robust Steiner tree and set cover, and the first approximation algorithms for k-robust Steiner forest, minimum-cut and multicut. All our approximation ratios (except for multicut) are almost best possible. As a by-product of our techniques, we also get algorithms for max-min problems of the form: "given a covering problem instance, which k of the elements are costliest to cover?".Comment: 24 page

The QWalk Simulator of Quantum Walks

Several research groups are giving special attention to quantum walks recently, because this research area have been used with success in the development of new efficient quantum algorithms. A general simulator of quantum walks is very important for the development of this area, since it allows the researchers to focus on the mathematical and physical aspects of the research instead of deviating the efforts to the implementation of specific numerical simulations. In this paper we present QWalk, a quantum walk simulator for one- and two-dimensional lattices. Finite two-dimensional lattices with generic topologies can be used. Decoherence can be simulated by performing measurements or by breaking links of the lattice. We use examples to explain the usage of the software and to show some recent results of the literature that are easily reproduced by the simulator.Comment: 21 pages, 11 figures. Accepted in Computer Physics Communications. Simulator can be downloaded from http://qubit.lncc.br/qwal

A Robust Bearing Fault Detection and Diagnosis Technique for Brushless DC Motors Under Non-stationary Operating Conditions

Rolling element bearing defects are among the main reasons for the breakdown of electrical machines, and therefore, early diagnosis of these is necessary to avoid more catastrophic failure consequences. This paper presents a novel approach for identifying rolling element bearing defects in brushless DC motors under non-stationary operating conditions. Stator current and lateral vibration measurements are selected as fault indicators to extract meaningful features, using a discrete wavelet transform. These features are further reduced via the application of orthogonal fuzzy neighbourhood discriminative analysis. A recurrent neural network is then used to detect and classify the presence of bearing faults. The proposed system is implemented and tested in simulation on data collected from an experimental setup, to verify its effectiveness and reliability in accurately detecting and classifying the various faults